Large-deviations/thermodynamic approach to percolation on the complete graph
نویسندگان
چکیده
We present a large-deviations/thermodynamic approach to the classic problem of percolation on the complete graph. Specifically, we determine the large-deviation rate function for the probability that the giant component occupies a fixed fraction of the graph while all other components are “small.” One consequence is an immediate derivation of the “cavity” formula for the fraction of vertices in the giant component. As a by-product of our analysis we compute the large-deviation rate functions for the probability of the event that the random graph is connected, the event that it contains no cycles and the event that it contains only “small” components.
منابع مشابه
Clique percolation in random networks.
The notion of k-clique percolation in random graphs is introduced, where k is the size of the complete subgraphs whose large scale organizations are analytically and numerically investigated. For the Erdos-Rényi graph of N vertices we obtain that the percolation transition of k-cliques takes place when the probability of two vertices being connected by an edge reaches the threshold p(c) (k) = [...
متن کاملRandom subgraphs of finite graphs: II. The lace expansion and the triangle condition
In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper, we use a new and simplified approach to the l...
متن کاملRandom Subgraphs of Finite Graphs. Ii. the Lace Expansion and the Triangle Condition by Christian Borgs,
In a previous paper we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper we use a new and simplified approach to the lac...
متن کاملClique percolation in random graphs
As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two k cliques means that they share at least l<k vertices. In this paper we develop a theoretical approach to study clique percolation in Erdős-Rényi graphs, which gives not only the exact solutions of the critical point, but also the corresponding order para...
متن کاملLayered Percolation on the Complete Graph
We present a generalized (multitype) version of percolation on the complete graph, in which we divide the vertices of the graph into a fixed number of sets (called layers) and perform percolation where the probability of {u, v} being in our edge set depends on the respective layers of u and v. Many results analogous to usual percolation on the complete graph are determined. In addition, we dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 31 شماره
صفحات -
تاریخ انتشار 2007